Unpredictable Binary Strings
نویسندگان
چکیده
We examine a class of binary strings arising from considerations about stream cipher encryption: to what degree can one guarantee that the number of pairs of entries distance k apart that disagree is equal to the number that agree, for all small k? In a certain sense, a keystream with such a property achieves a degree of unpredictability. The problem is also restated combinatorially in terms of seating arrangements. We examine sequences s of length 2n in which this property holds for all k ≤ Mn, where Mn is the largest number for which this is possible among strings of length 2n. We give upper and lower bounds for Mn, and give optimal sequences of all lengths up to n = 26. We also show how to obtain classes of special orthogonal arrays and balanced sign graphs from such sequences.
منابع مشابه
Unpredictable strings are collectives
In [Z] we defined the notion of an “inference method” which given a finite binary string guesses its continuation. We showed that a special class of these inference methods could be used to construct a very general theory of confirmation. In this paper we investigate the class of strings which are unpredictable with respect to these inference method-that is, infinite strings which are such that...
متن کاملA Comparison of Two Approaches
The concept of pseudorandomness plays an important role in cryptography. In this note we contrast the notions of complexity-theoretic pseudoran-dom strings (from algorithmic information theory) and pseudorandom strings (from cryptography). For example, we show that we can easily distinguish a complexity-theoretic pseudorandom ensemble from the uniform ensemble. Both notions of pseudorandom stri...
متن کاملA comparison of two approaches to pseudorandomness
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic information theory) and pseudorandom strings (from cryptography). For example, we show that we can easily distinguish a complexity-theoretic pseudorandom ensemble from the uniform ensemble. Both notions of pseudorandom stri...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملSelforganization in a System of Binary Strings with Topological Interactions
We consider an artiicial reaction system whose components are binary strings. Upon encounter, two binary strings produce a third string which competes for storage space with the originators. String types or species can only survive when produced in suucient numbers. Spatial interactions through introduction of a topology and rules for distance-dependent reactions are discussed. We observe three...
متن کامل